Wardrop Equilibrium
   HOME

TheInfoList



OR:

John Glen Wardrop (1922–1989), born in
Warwick Warwick ( ) is a market town, civil parish and the county town of Warwickshire in the Warwick District in England, adjacent to the River Avon. It is south of Coventry, and south-east of Birmingham. It is adjoined with Leamington Spa and Whi ...
,
England England is a country that is part of the United Kingdom. It shares land borders with Wales to its west and Scotland to its north. The Irish Sea lies northwest and the Celtic Sea to the southwest. It is separated from continental Europe b ...
, was an English mathematician and transport analyst who developed what became known as Wardrop's first and second principles of equilibrium in the field of
traffic assignment Route assignment, route choice, or traffic assignment concerns the selection of routes (alternative called paths) between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting ...
. He studied at Downing College, Cambridge, and worked in
Operational Research Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decis ...
at British Bomber Command during the Second World War. He then helped to set up, and later headed, the Traffic Section of the Road Research Laboratory near Slough (Part of the Directorate of Scientific and Industrial Research within the UK Civil Service) where he published his work on equilibrium. He subsequently followed Dr Reuben Smeed to University College London, becoming Reader Emeritus in Traffic Studies.


Wardrop equilibria

In studies about
traffic assignment Route assignment, route choice, or traffic assignment concerns the selection of routes (alternative called paths) between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting ...
, network equilibrium models are commonly used for the prediction of traffic patterns in transportation networks that are subject to congestion. The idea of traffic equilibrium originated as early as 1924, with
Frank Knight Frank Hyneman Knight (November 7, 1885 – April 15, 1972) was an American economist who spent most of his career at the University of Chicago, where he became one of the founders of the Chicago School. Nobel laureates Milton Friedman, George S ...
. The concepts are related to the idea of
Nash equilibrium In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equili ...
in
game theory Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has appli ...
developed separately. However, in transportation networks, there are many players, making the analysis complex. In 1952, Wardrop stated two principles that formalize different notions of equilibrium, and introduced the alternative behaviour postulate of the minimization of the total travel costs: Wardrop's first principle of route choice, now known as "user equilibrium", "selfish Wardrop equilibrium" or just "Wardrop equilibrium", which is identical to the notion postulated by Knight, became accepted as a sound and simple behavioural principle to describe the spreading of trips over alternate routes because of congested conditions. It states that the journey times in all routes actually used are equal and less than those that would be experienced by a single vehicle on any unused route. The traffic flows that satisfy this principle are usually referred to as "user equilibrium" (UE) flows, since each user chooses the route that is the best. Specifically, a user-optimized equilibrium is reached when no user may lower his transportation cost through unilateral action. A variant is the stochastic user equilibrium (SUE), in which no driver can unilaterally change routes to improve his/her perceived, rather than actual, travel times. Wardrop's second principle, now known as "system optimal" or "social Wardrop equilibrium" states that at equilibrium, the average journey time is at a minimum. That implies that all users behave cooperatively in choosing their routes to ensure the most efficient use of the whole system. For example, this would be the case if an omnipotent central authority could command them all which routes to take. Traffic flows satisfying Wardrop's second principle are generally deemed system optimal (SO). Economists and modellers have argued that it can be achieved with
marginal cost In economics, the marginal cost is the change in the total cost that arises when the quantity produced is incremented, the cost of producing additional quantity. In some contexts, it refers to an increment of one unit of output, and in others it r ...
road pricing Road pricing (also road user charges) are direct charges levied for the use of roads, including road tolls, distance or time-based fees, congestion charges and charges designed to discourage the use of certain classes of vehicle, fuel sour ...
, or by a central routing authority dictating route choices. The potential fall in efficiency from social to selfish equilibria is an example of the
price of anarchy The Price of Anarchy (PoA) is a concept in economics and game theory that measures how the efficiency of a system degrades due to selfish behavior of its agents. It is a general notion that can be extended to diverse systems and notions of effici ...
. Wardrop did not provide algorithms for solving Wardrop equilibria, he simply defined them as desiderata. The first mathematical model of network equilibrium was formulated by Beckmann, McGuire and Winsten in 1956. As with Nash equilibria, simple solutions to selfish equilibrium can be found through iterative simulation, with each agent assigning its route given the choices of the others. This is very slow computationally. The
Frank–Wolfe algorithm The Frank–Wolfe algorithm is an iterative first-order optimization algorithm for constrained convex optimization. Also known as the conditional gradient method, reduced gradient algorithm and the convex combination algorithm, the method was orig ...
improves on this by exploiting dynamic programming properties of the network structure, to find solutions with a faster form of iteration. Creating new and faster algorithms for both selfish and social Wardrop equilibria remains an active research topic in the 2010s.


References

* *
Obituary, John Glen Wardrop ''Transportation'' 16 pp. 1-2 (1989)
{{DEFAULTSORT:Wardrop, John Glen English economists Game theorists 1989 deaths 1922 births